By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Volume 6, Issue 1, pp. 1-199

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Optimal Polyphase Sorting

Derek A. Zave

pp. 1-39

Single Machine Job Sequencing with Precedence Constraints

Donald L. Adolphson

pp. 40-54

Smallest Augmentations to Biconnect a Graph

Arnie Rosenthal and Anita Goldner

pp. 55-66

Polynomial Complete Consecutive Information Retrieval Problems

Lawrence T. Kou

pp. 67-75

On the Complexity of Local Search for the Traveling Salesman Problem

Christos H. Papadimitriou and Kenneth Steiglitz

pp. 76-83

A Fast Monte-Carlo Test for Primality

R. Solovay and V. Strassen

pp. 84-85

Comments on F. Hadlock's Paper: "Finding a Maximum Cut of a Planar Graph in Polynomial Time"

K. Aoshima and M. Iri

pp. 86-87

A Graph-Theoretic Characterization of the $\text{PV}_{\text{chunk}}$ Class of Synchronizing Primitives

Peter B. Henderson and Yechezkel Zalcstein

pp. 88-108

Evaluating Relational Expressions with Dense and Sparse Arguments

T. G. Szymanski and J. D. Ullman

pp. 109-122

Derivation Complexity in Context-Free Grammar Forms

Seymour Ginsburg and Nancy Lynch

pp. 123-138

Two Algorithms for Generating Weighted Spanning Trees in Order

Harold N. Gabow

pp. 139-150

A Linear Tree Partitioning Algorithm

Sukhamay Kundu and Jayadev Misra

pp. 151-154

Bounds for LPT Schedules on Uniform Processors

Teofilo Gonzalez, Oscar H. Ibarra, and Sartaj Sahni

pp. 155-166

Task Scheduling on a Multiprocessor System with Independent Memories

D. G. Kafura and V. Y. Shen

pp. 167-187

Addition Requirements for Rational Functions

David G. Kirkpatrick and Zvi M. Kedem

pp. 188-199